A degree condition for the existence of 1-factors in graphs or their complements

A degree condition for the existence of connected factors

All under collsidfcration vertiCt~S x and y. We write II subsets X and Y of we denote and y functions defined on has a, rnatch·· is a connected t= GiVPll of G induc~'d to be the neighborhood of x. Let 1 and 9 be 1(v) _ g(v) dG(v) for aJl

A Degree Condition For Graphs to Have Connected (g, f)-Factors

study of cohesive devices in the textbook of english for the students of apsychology by rastegarpour

this study investigates the cohesive devices used in the textbook of english for the students of psychology. the research questions and hypotheses in the present study are based on what frequency and distribution of grammatical and lexical cohesive devices are. then, to answer the questions all grammatical and lexical cohesive devices in reading comprehension passages from 6 units of 21units th...

a degree condition for graphs to have connected (g, f)-factors

A degree condition for the existence of k-factors with prescribed properties

We consider only finite undirected graphs without loops or multiple edges. Let G be a graph with vertex set V(G) and edge set E(G). For a vertex x ∈V(G), we write NG(v) for the set of vertices of V(G) adjacent to v, NG[v] for NG(v) ⋃{v}, and dG(v) = |NG(v)| for the degree of v in G. If S and T are disjoint subsets of V(G), then eG(S,T) denotes the number of edges that join S and T , and G− S de...